GATE CSE 2015 SET-2
Q2.
With reference to the B+ tree index of order 1 shown below, the minimum number of nodes (including the Root node) that must be fetched in order to satisfy the following query: "Get all records with a search key greater than or equal to 7 and less than 15" is ____________.Q3.
Assume that for a certain processor, a read request takes 50 nanoseconds on a cache miss and 5 nanoseconds on a cache hit. Suppose while running a program, it was observed that 80% of the processor's read requests result in a cache hit. The average read access time in nanoseconds is __________.Q4.
Let f(x)=x^{-(1/3)} and A denote the area of the region bounded by f(x) and the x-axis, when x varies from -1 to 1. Which of the following statements is/are TRUE? I) f is continuous in [-1,1] II) f is not bounded in [-1,1] III) f is nonzero and finiteQ6.
A binary tree T has 20 leaves. The number of nodes in T having two children is _______.Q7.
Consider the C program below. #include < stdio.h > int *A, stkTop; int stkFunc(int opcode, int val) { static int size=0, stkTop=0; switch (opcode) { case -1: size = val; break; case 0: if (stkTop < size) A[stkTop++] = val; break; default: if (stkTop) return A[--stkTop]; } return -1; } int main() { int B[20]; A = B; stkTop = -1; stkFunc (-1, 10); stkFunc ( 0, 5); stkFunc ( 0, 10); printf ("%d\n", stkFunc(1, 0) + stkFunc(1, 0)); } The value printed by the above program is __________.Q8.
A link has a transmission speed of 10^{6} bits/sec. It uses data packets of size 1000 bytes each. Assume that the acknowledgment has negligible transmission delay, and that its propagation delay is the same as the data propagation delay. Also assume that the processing delays at nodes are negligible. The efficiency of the stop-and-wait protocol in this setup is exactly 25%. The value of the one-way propagation delay (in milliseconds) is ________.Q9.
A system has 6 identical resources and N processes competing for them. Each process can request atmost 2 resources. Which one of the following values of N could lead to a deadlock?Q10.
Given below are some algorithms, and some algorithm design paradigms. Match the above algorithms on the left to the corresponding design paradigm they follow.